Poly-logarithmic localization for random walks among random obstacles
نویسندگان
چکیده
منابع مشابه
Localization for controlled random walks and martingales
We consider controlled random walks that are martingales with uniformly bounded increments and nontrivial jump probabilities and show that such walks can be constructed so that P (Su n = 0) decays at polynomial rate n where α > 0 can be arbitrarily small. We also show, by means of a general delocalization lemma for martingales, which is of independent interest, that slower than polynomial decay...
متن کاملLogarithmic Sobolev techniques for random walks on graphs
Recently, Diaconis and Sarloff-Coste used logarithmic Sobolev inequalities to improve convergence bounds for random walks on graphs. We will give a strengthened version by showing that the random walk on a graph G on n vertices reach the stationarity (under total variation distance) after about 1 4α log log n steps where α denotes the log-Sobolev constant. Under the relative pointwise distance ...
متن کاملLocalization transition of biased random walks on random networks.
We study random walks on large random graphs that are biased towards a randomly chosen but fixed target node. We show that a critical bias strength bc exists such that most walks find the target within a finite time when b > bc. For b < bc, a finite fraction of walks drift off to infinity before hitting the target. The phase transition at b=bc is a critical point in the sense that quantities su...
متن کاملOn the speed of Random Walks among Random Conductances
We consider random walk among random conductances where the conductance environment is shift invariant and ergodic. We study which moment conditions of the conductances guarantee speed zero of the random walk. We show that if there exists α > 1 such that E[log ωe] < ∞, then the random walk has speed zero. On the other hand, for each α < 1 we provide examples of random walks with non-zero speed ...
متن کاملA PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 2019
ISSN: 0091-1798
DOI: 10.1214/18-aop1300